Hamburger Beitrage zur Angewandten Mathematik Numerical Computation of Degenerate Hopf Bifurcation Points

نویسندگان

  • Haihong Xu
  • Vladimir Janovsky
  • Bodo Werner
  • HAIHONG XU
چکیده

In this paper a numerical method for the detection and computation of degenerate Hopf bifurcation points is presented. The degeneracies are classi ed and de ning equations characterizing each of the equivalence classes are constructed by means of a generalized Liapunov-Schmidt reduction. The numerical computation of the sign of the rst Liapunov coe cient which determines the stability of the bifurcating periodic orbits is discussed as well. Numerical experiments are performed for the clamped Hodgkin-Huxley equations.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hamburger Beitrage zur Angewandten Mathematik Image Processing for Numerical Approximations of Conservation Laws: Nonlinear anisotropic arti cial dissipation

We employ a nonlinear anisotropic di usion operator like the ones used as a means of ltering and edge enhancement in image processing, in numerical methods for conservation laws. It turns out that algorithms currently used in image processing are very well suited for the design of nonlinear higher-order dissipative terms. In particular, we stabilize the well-known Lax-Wendro formula by means of...

متن کامل

Hamburger Beitrage zur Angewandten Mathematik Beyond Montonicity in Regularization Methods for Nonlinear Complementarity Problems

Regularization methods for the solution of nonlinear complementarity problems are standard methods for the solution of monotone complementarity problems and possess strong convergence properties. In this paper, we replace the monotonicity assumption by a P0-function condition. We show that many properties of regularization methods still hold for this larger class of problems. However, we also p...

متن کامل

Hamburger Beitrage zur Angewandten Mathematik Digital Lines and Digital Convexity

Euclidean geometry on a computer is concerned with the translation of geometric concepts into a discrete world in order to cope with the requirements of representation of abstract geometry on a computer. The basic constructs of digital geometry are digital lines, digital line segments and digitally convex sets. The aim of this paper is to review some approaches for such digital objects. It is s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998